CUBES IN FINITE FIELDS AND RELATED PERMUTATIONS

نویسندگان

چکیده

Abstract Let $p=3n+1$ be a prime with $n\in \mathbb {N}=\{0,1,2,\ldots \}$ and let $g\in {Z}$ primitive root modulo p . $0<a_1<\cdots <a_n<p$ all the cubic residues in interval $(0,p)$ Then clearly sequence $a_1 \bmod p,\, a_2 p,\ldots , a_n p$ is permutation of $g^3 p,\,g^6 g^{3n} We determine sign this permutation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutations, hyperplanes and polynomials over finite fields

Starting with a result in combinatorial number theory we prove that (apart from a couple of exceptions that can be classified), for any elements a1, . . . , an of GF (q), there are distinct field elements b1, . . . , bn such that a1b1 + · · ·+ anbn = 0. This implies the classification of hyperplanes lying in the union of the hyperplanes Xi = Xj in a vector space over GF (q), and also the classi...

متن کامل

Permutations of finite fields with prescribed properties

For cryptographic applications, the behaviour of the difference map is of importance and since there are no perfect nonlinear (PN) permutations, almost perfect nonlinear (APN) permutations have attracted a lot of attention in the last decades. Costas permutations, which are also extreme with respect to the behaviour of their difference maps, were originally introduced in connection with applica...

متن کامل

On constructing permutations of finite fields

Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of Fq. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of Fq.

متن کامل

Constructing permutations of finite fields via linear translators

We study the permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn is a linear translator of f : Fqn → Fq. We determine the cycle structure and the inverse of such a permutation. We describe several families of permutation polynomials obtained using functions with linear translators.

متن کامل

Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials

In this paper we study permutations of finite fields Fq that decompose as products of cycles of the same length, and are obtained using monomials x ∈ Fq[x]. We give the necessary and sufficient conditions on the exponent i to obtain such permutations. We also present formulas for counting the number of this type of permutations. An application to the construction of encoders for turbo codes is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of The Australian Mathematical Society

سال: 2021

ISSN: ['0004-9727', '1755-1633']

DOI: https://doi.org/10.1017/s000497272100054x